Asymptotic Analysis for One-Stage Stochastic Linear Complementarity Problems and Applications
نویسندگان
چکیده
One-stage stochastic linear complementarity problem (SLCP) is a special case of multi-stage problem, which has important applications in economic engineering and operations management. In this paper, we establish asymptotic analysis results sample-average approximation (SAA) estimator for the SLCP. The normality stochastic-constrained optimization are extended to SLCP model then conditions, ensure convergence distribution multivariate normal with zero mean vector covariance matrix, obtained. obtained finally applied estimating confidence region solution
منابع مشابه
Improved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملExpected Residual Minimization Method for Stochastic Linear Complementarity Problems
This paper presents a new formulation for the stochastic linear complementarity problem (SLCP), which aims at minimizing an expected residual defined by an NCP function. We generate observations by the quasi-Monte Carlo methods and prove that every accumulation point of minimizers of discrete approximation problems is a minimum expected residual solution of the SLCP. We show that a sufficient c...
متن کاملDiscrete Approximation of Two-Stage Stochastic and Distributionally Robust Linear Complementarity Problems
In this paper, we propose a discretization scheme for the two-stage stochastic linear complementarity problem (LCP) where the underlying random data are continuously distributed. Under some moderate conditions, we derive qualitative and quantitative convergence for the solutions obtained from solving the discretized two-stage stochastic LCP (SLCP). We explain how the discretized two-stage SLCP ...
متن کاملSimple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems
We show that the problem of finding optimal strategies for both players in a simple stochastic game reduces to the generalized linear complementarity problem (GLCP) with a P-matrix, a well-studied problem whose hardness would imply NP = co-NP. This makes the rich GLCP theory and numerous existing algorithms available for simple stochastic games. As a special case, we get a reduction from binary...
متن کاملAnalysis and Application of A One-Layer Neural Network for Solving Horizontal Linear Complementarity Problems
In this paper, we analyze the stability and convergence of a one-layer neural network proposed by Gao and Wang, which is designed to solve a class of horizontal linear complementarity problems. The globally asymptotical stability and globally exponential stability of this network are proved strictly under mild conditions, respectively. Meanwhile, this network is applied to solve a transportatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11020482